Discrete convexity: convexity for functions defined on discrete spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On difference sequence spaces defined by Orlicz functions without convexity

In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.  

متن کامل

on difference sequence spaces defined by orlicz functions without convexity

in this paper, we first define spaces of single difference sequences defined by a sequence of orlicz functions without convexity and investigate their properties. then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.

متن کامل

Polyhedrally Tight Set Functions and Discrete Convexity

This paper studies the class of polyhedrally tight functions in terms of the basic theorems on convex functions over <n, such as the Fenchel Duality Theorem, Separation Theorem etc. (Polyhedrally tight functions are those for which the inequalities y x ≤ f(y), y ∈ A in x ∈ A∗ with A,A∗ ⊆ <n can be satisfied as equalities for some vector x, not necessarily simultaneously.) It is shown, using res...

متن کامل

Discrete Midpoint Convexity

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...

متن کامل

Convexity in Discrete Space

This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell complexes. Oriented matroids are shown to have a structure which naturally satisfies the axioms for being a convex geometry. Cell complexes are shown to give rise to various different notions of convexity, one of which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2002

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(01)00191-3